Displacement operator based decompositions of matrices using circulants or other group matrices
نویسندگان
چکیده
منابع مشابه
Matrix Decompositions Using sub-Gaussian Random Matrices
In recent years, several algorithms which approximate matrix decomposition have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We present a new algorithm, which achieves with high probability a rank-r SVD approximation of an n × n matrix and derive an error bound that does not depend on the first r singular values. Althou...
متن کاملMatrices. Abelian Group of Matrices
The articles [11], [6], [13], [14], [4], [5], [2], [10], [8], [3], [7], [12], [9], and [1] provide the notation and terminology for this paper. For simplicity, we follow the rules: x is a set, i, j, n, m are natural numbers, D is a non empty set, K is a non empty double loop structure, s is a finite sequence, a, a1, a2, b1, b2, d are elements of D, p, p1, p2 are finite sequences of elements of ...
متن کاملSum Decompositions of Symmetric Matrices
Given a symmetric n X n matrix A and n numbers rl," " rn , necessary and sufficient conditions for the existence of a matrix B, with a given zero pattern, with row sums r 1 , ... , rn , and such that A = B + BT are proven. If the pattern restriction * The research of all three authors was supported by the Funda~ao Calouste Gulbenkian, Lisboa. tThe research of this author was carried out within ...
متن کاملOn Smooth Decompositions of Matrices
In this paper we consider smooth orthonormal decompositions of smooth time varying matrices. Among others, we consider QR–, Schur–, and singular value decompositions, and their block-analogues. Sufficient conditions for existence of such decompositions are given and differential equations for the factors are derived. Also generic smoothness of these factors is discussed.
متن کاملComputing Orthogonal Decompositions of Block Tridiagonal or Banded Matrices
A method for computing orthogonal URV/ULV decompositions of block tridiagonal (or banded) matrices is presented. The method discussed transforms the matrix into structured triangular form and has several attractive properties: The block tridiagonal structure is fully exploited; high data locality is achieved, which is important for high efficiency on modern computer systems; very little fill-in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1990
ISSN: 0024-3795
DOI: 10.1016/0024-3795(90)90392-p